An improved heuristic-dynamic programming algorithm for rectangular cutting problem
نویسندگان
چکیده
منابع مشابه
An ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملAn Improved DPSO Algorithm for Cell Formation Problem
Cellular manufacturing system, an application of group technology, has been considered as an effective method to obtain productivity in a factory. For design of manufacturing cells, several mathematical models and various algorithms have been proposed in literature. In the present research, we propose an improved version of discrete particle swarm optimization (PSO) to solve manufacturing cell ...
متن کاملA Hybrid Heuristic Algorithm for the Rectangular Packing Problem
A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-andconquer and greedy strategies. The computational results on a class of benchmark problems have shown that the performance of the heuristic algorithm can outperform that of quasi-human heuristics.
متن کاملA Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...
متن کاملA Progressive Heuristic Search Algorithm for the Cutting Stock Problem
This paper presents a new variant of the A class algorithms for solving the known one dimensional cutting stock problem in a card board factory where the objective is to minimise the useless remaining of a continuous cardboard surface The algorithm limits the number of nodes in the tree search by using a bound criterion based on the prob lem restrictions The process of computing the solution is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2020
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis200125017y